Alternative Coins for Quantum Random Walk Search Optimized for a Hypercube
نویسندگان
چکیده
منابع مشابه
Optimized quantum random-walk search algorithms
Shenvi, Kempe and Whaley’s quantum random-walk search (SKW) algorithm [2003 Phys. Rev. A 67 052307] is known to require O( √ N) number of oracle queries to find the marked element, where N is the size of the search space. This scaling is thought to be the best achievable on a quantum computer. We prove that the final state of the quantum walk in the SKW algorithm yields the nearest neighbours o...
متن کاملA Quantum Random Walk Search Algorithm
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speed-up over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random walk architectu...
متن کاملCutoff for a Stratified Random Walk on the Hypercube
We consider the random walk on the hypercube which moves by picking an ordered pair (i, j) of distinct coordinates uniformly at random and adding the bit at location i to the bit at location j, modulo 2. We show that this Markov chain has cutoff at time 2n logn with window of size n, solving a question posed by Chung and Graham (1997). 1998 ACM Subject Classification G.3 Probability
متن کاملQuantum random walk search on satisfiability problems
Using numerical simulation, we measured the performance of several potential quantum algorithms, based on quantum random walks, to solve Boolean satisfiability (SAT) problems. We develop the fundamentals of quantum computing and the theory of classical algorithms to indicate how these algorithms could be implemented. We also discuss the development of quantum random walks and the principles tha...
متن کاملIdentifying several biased coins encountered by a hidden random walk
Suppose that attached to each site z ∈ Z is a coin with bias θ(z), and only finitely many of these coins have non-zero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its current position. Then we can determine the biases {θ(z)}z∈Z, using only the outcomes of these coin tosses and no information about the path of the random walker, up t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Quantum Information Science
سال: 2015
ISSN: 2162-5751,2162-576X
DOI: 10.4236/jqis.2015.51002